Robust Receipt-Free Election System with Ballot Secrecy and Verifiability

نویسندگان

  • Sherman S. M. Chow
  • Joseph K. Liu
  • Duncan S. Wong
چکیده

For most elections, receipt-freeness is important – voters are unable to prove to others on how they voted, in order to prevent vote-buying. Many existing receipt-free electronic voting systems are not practical enough as they require voters to participate in the tallying phase (i.e. do not satisfy the vote-and-go requirement), or have no mechanism for the voters to verify whether their votes have been counted (i.e. do not satisfy universal verifiability). We propose a new way of constructing vote-and-go election system without tamper-resistant hardware, or anonymous channel. Receipt-freeness is guaranteed even if there is only one voting authority (in a distributed setting) being honest. Regarding the correctness, voter alone has no chance to tamper with the validity of the final tally, while any misbehaving authority can be detected (and proven to the public) by the tallying center. Robustness can be achieved by fixing the corrupted vote in a verifiable manner. Ballot secrecy cannot be compromised even if all tallying authorities collude.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Receipt-Free E-Voting Scheme Based on Blind Signature (Abstract)

Electronic voting has attracted much interest recently and a variety of schemes have been proposed. Generally speaking, all these schemes can be divided into three main approaches: based on blind signature, based on mix networks and based on homomorphic encryption. Schemes based on blind signature are thought to be simple, efficient, and suitable for large scale elections. Fujioka, Okamoto and ...

متن کامل

Security Proofs for Participation Privacy, Receipt-Freeness, Ballot Privacy, and Verifiability Against Malicious Bulletin Board for the Helios Voting Scheme

The Helios voting scheme is well studied including formal proofs for verifiability and ballot privacy. However, depending on its version, the scheme provides either participation privacy (hiding who participated in the election) or verifiability against malicious bulletin board (preventing election manipulation by ballot stuffing), but not both at the same time. It also does not provide receipt...

متن کامل

No . CS - TR - 1114 July , 2008

It is immensely challenging to devise a voting system that guarantees both the correct reflection of the will of the voters and the secrecy of the ballots, based solely on compelling, objective evidence. In response to this challenge, various voting protocols have been proposed, typically using cryptography, that seek to base the assurance of accuracy on transparency and auditability. This appr...

متن کامل

Scantegrity III: Automatic Trustworthy Receipts, Highlighting Over/Under Votes, and Full Voter Verifiability

Building on lessons learned from the November 2009 Scantegrity II election in Takoma Park, MD, we propose improvements to the Scantegrity II voting system that (1) automatically print trustworthy receipts for easier on-line verification, (2) highlight ballot features including over/under votes to comply with the Help America Vote Act, and (3) achieve full voter verifiability by eliminating prin...

متن کامل

Randomized voting

In theory, an election is a simple process: People express their preferences. The winner is the candidate preferred by the majority. In practice, an election is a amalgam of many choices and procedures, each of which can affect the outcome. These aspects run from the gamut from “Who is eligible to vote?” to “How does a voter physically express her preferences?” to “What mechanisms protect again...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008